An Adaptive Chosen-plaintext Attack of the Improved Cellular Message Encryption Algorithm
نویسندگان
چکیده
This paper analyzes the Improved Cellular Message Encryption Algorithm (CMEA-I) which is an improved version of the Telecommunication Industry Association’s Cellular Message Encryption Algorithm (CMEA). We present a chosen-plaintext attack of CMEA-I which requires less than 850 plaintexts in its adaptive version. This demonstrates that the improvements made over CMEA are ineffective to thwart such attacks and confirms that the security of CMEA and its variants must be reconsidered from the beginning.
منابع مشابه
Cryptanalysis of the Improved Cellular Message Encryption Algorithm
This paper analyzes the Improved Cellular Message Encryption Algorithm (CMEA-I) which is an improved version of the Telecommunication Industry Association’s Cellular Message Encryption Algorithm (CMEA). We present a chosen-plaintext attack of CMEA-I which requires less than 850 plaintexts in its adaptive version. This demonstrates that the improvements made over CMEA are ineffective to thwart s...
متن کاملAn Attribute-Based Anonymous Broadcast Encryption Scheme with Adaptive Security in the Standard Model
In broadcast encryption schemes, a distribution center broadcasts an encrypted message to a subset S chosen from a universe of receivers and only the intended users are able to decrypt the message. Most broadcast encryption schemes do not provide anonymity and the identities of target receivers are sent in plaintext. However, in several applications, the authorized users’ identities has the sam...
متن کاملDifferential Chosen-Plaintext Cryptanalysis of an Improved Fast Encryption Algorithm for Multimedia (FEA-M)
This paper studies the security of an improved fast encryption algorithm for multimedia (FEA-M). A simple differential chosen-plaintext attack is proposed to completely break the improved FEA-M. The proposed attack is very efficient in complexity and needs only two pairs of chosen plaintext blocks.
متن کاملEfficient Chosen-Ciphtertext Secure Public Key Encryption Scheme From Lattice Assumption
Using the Bonsai trees primitive and Gentry’s CPA-secure (chosen-plaintext attack) public-key encryption (PKE) scheme, we propose an efficient chosen-ciphtertext secure PKE scheme over lattice. If the decision variant of the learning with errors (LWE) problem is hard and the one-time signature used in this scheme is strong unforgeable, the proposed PKE scheme is indistinguishable against the ad...
متن کاملA Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
An adaptive chosen ciphertext attack against PKCS #1 v2.0 RSA OAEP encryption is described. It recovers the plaintext – not the private key – from a given ciphertext in a little over log2 n queries of an oracle implementing the algorithm, where n is the RSA modulus. The high likelihood of implementations being susceptible to this attack is explained as well as the practicality of the attack. Im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 9 شماره
صفحات -
تاریخ انتشار 2009